Faster DTMF Decoding
نویسندگان
چکیده
In this paper, a new method for the decoding of DTMF signals is proposed. The approach, which applies the Arithmetic Fourier Transform, is more efficient, in terms of computational complexity, than existing techniques. Theoretical aspects and features that determine the accuracy and the complexity of the proposed method are discussed.
منابع مشابه
Efficient Decoding of Digital Dtmf and R2 Tone Signalization
In this paper the implementation aspects of decoding digital DTMF and R2 signalization tones are analyzed. First, a short review of specifications for DTMF and R2 signalization, proposed by ITU-T is made, following by short review of decoding techniques applied in practice. Finally, a new computationally efficient method is proposed and experimentally verified. This method has distinct advantag...
متن کاملLiterature Survey on Dual-tone Multiple Frequency Dtmf Detector Implementation
Dual-tone Multi-frequency (DTMF) Signals are used in touch-tone telephones as well as many other areas. Since analog devices are rapidly changing with digital devices, digital DTMF decoders become important. There are many DTMF decoding algorithms, but most of them cannot comply with the related International Telecommunications Union (ITU) and Bell Communications Research, Inc. (Bellcore) recom...
متن کاملPerformance of dual tone multi-frequency signal decoding algorithm using the sub-band non-uniform discrete Fourier transform on the ADSP-2192 processor
Efficient decoding of Dual Tone Multi-Frequency (DTMF) signals can be achieved using the sub-band non-uniform discrete Fourier transform (SB-NDFT). In this paper, the details of its implementation on the ADSP-2192 processor are put forward. The decoder performance in terms of its computational complexity and computational speed of this algorithm, implemented on the ADSP-2192 processor, are comp...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کامل